Expedited Broda-Damas bracket abstraction
نویسندگان
چکیده
منابع مشابه
Expedited Broda-Damas Bracket Abstraction
A bracket abstraction algorithm is a means of translating λ-terms into combinators. Broda and Damas, in [1], introduce a new, rather natural set of combinators and a new form of bracket abstraction which introduces at most one combinator for each λ-abstraction. This leads to particularly compact combinatory terms. A disadvantage of their abstraction process is that it includes the whole Schonfi...
متن کاملSome Improvements to Turner's Algorithm for Bracket Abstraction
A computer handles A-terms more easily if these are translated into combinatory terms. This translation process is called bracket abstraction. The simplest abstraction algorithm-the (fab) algorithm of Curry (see Curry and Feys [6])-is lengthy to implement and produces combinatory terms that increase rapidly in length as the number of variables to be abstracted increases.
متن کاملBracket Abstraction in the Combinator System C`(k)
Translations from lambda calculi to combinatory logics can be used to avoid some implementational problems of the former systems. However, this scheme can only be eecient if the translation produces short output with a small number of combinators, in order to reduce the time and transient storage space spent during reduction of combinatory terms. In this paper we present a combinatory system an...
متن کاملEfficient Bracket Abstraction Using Iconic Representations for Combinators
Some fundamental properties of a new uni-variate bracket abstraction algorithm employing a string representation for combinators are established. In particular, if the input term has length n, where n > 1, the algorithm is called fewer than n times to produce the abstract. Furthermore, the space required to store the abstract, in the worst case, is of the order O(n). This algorithm also has a n...
متن کاملDAMAS-Rescue Description Paper
In this paper, we describe DAMAS-Rescue, a team of agents participating in the RoboCupRescue simulation competition. In the following, we explain the strategies of all our agents that will be used at the world competition in 2004 at Lisbon in Portugal. In short, FireBrigade agents are choosing the best fire to extinguish based on the knowledge they have learned with a selective perception learn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2000
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2695081